Theoretical and Computational Methods to Resistance Distances in Novel Graphs Operations

Distances between graphs under edge operations

We investigate three metrics on the isomorphism classes of graphs derived from elementary edge operations: the edge move, rotation and slide distances. We derive relations between the metrics, and bounds on the distance between arbitrary graphs and between arbitrary trees. We also consider the sensitivity of the metrics to various graph operations. Correspondence to: Wayne Goddard Dept of Compu...

Resistance distances and the Kirchhoff index in Cayley graphs

In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier's archiving and manuscript policies are encouraged to visit: a b s t r a c t In this paper, closed-form formulae for the Kirchhoff index and resistance distances of the Cayley graphs ov...

Warehouse Operations Revisited - Novel Challenges and Methods

Regions, Distances and Graphs

Avoir deux directeurs de thèse, c'est avant tout une richesse et une opportunité d'apprendre deux fois plus. Cela permet d'avoir deux points de vue, et cela forcè a faire ses propres choix. J'ai eu cepriviì ege. Aussi je voudrais remercier Jean et Stefan. D'abord pour m'avoir guidé, con-seillé, motivé; et pour avoir passé tout ce tempsà relire et corriger mes travaux. Mais aussi, et surtout, po...

Increasing Distances in Graphs

lie und meinen Freunden.